The E-BSP Model: Incorporating General Locality and Unbalanced Communication into the BSP Model
نویسندگان
چکیده
The BSP model was proposed as a step towards general purpose parallel computing. This paper introduces the E-BSP model that extends the BSP model in two ways. First, it provides a way to deal with unbalanced communication patterns, i.e., communication patterns in which the amount of data sent or received by each processor is different. Second, it adds a notion of general locality to the BSP model where the delay of a remote memory access depends on the relative location of the processors in the interconnection network. We use our model to develop several algorithms that improve upon algorithms derived under the BSP model.
منابع مشابه
The design and analysis of bulk-synchronous parallel algorithms
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. This thesis presents a systematic approach to the design and analysis of BSP algorithms. We introduce an extension of the BSP model, called BSPRAM, which reconciles shared-memory style programming with e cient exploitation of data locality. The BSPRAM model can be optimally si...
متن کاملMultiprogramming BSP Programs
We explore the problem of transforming a BSP program for execution on a multipro-gramming architecture, where it has to share resources with other BSP programs executing at the same time. 1 The BSP model The Bulk Synchronous Parallelism (BSP) 2] model is a general-purpose model that is both architecture-independent and eecient for most problems on today's architectures. A BSP program consists o...
متن کاملParallel Bridging Models and Their Impact on Algorithm Design
The aim of this paper is to demonstrate the impact of features of parallel computation models on the design of efficient parallel algorithms. For this purpose, we start with considering Valiant’s BSP model and design an optimal multisearch algorithm. For a realistic extension of this model which takes the critical blocksize into account, namely the BSP* model due to Bäumker, Dittrich, and Meyer...
متن کاملThe Bulk-Synchronous Parallel Random Access Machine
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Originally, BSP was defined as a distributed memory model. Shared-memory style BSP programming had to be provided by PRAM simulation. However, this approach destroys data locality and therefore may prove inefficient for many practical problems. In this paper we present a new B...
متن کاملProgramming Research Group NETWORK PERFORMANCE ASSESSMENT UNDER THE BSP MODEL
The BSP model by L.G. Valiant has been proposed as a unifying and bridging model for the design, analysis and programming of general purpose parallel computing systems. A number of libraries have been implemented that allow programming following the BSP paradigm with one of them being the Oxford BSP Toolset. Algorithm designers and software engineers are able to study the performance of their i...
متن کامل